Turing Completeness of Finite, Epistemic Programs
نویسندگان
چکیده
We use relational semantics to evaluate formulas. A Kripke model for L is a tuple M = (JMK , R, J·K) where JMK is a countable, non-empty set of states, R : I −→ P(JMK × JMK) assigns to each i ∈ I an accessibility relation Ri, and J·K : Φ −→ P(JMK) is a valuation, assigning to each atom a set of states. With s ∈ JMK, call Ms = (JMK , R, J·K , s) a pointed Kripke model. The used semantics are standard (see e.g. [4, 7]), including the modal clause:
منابع مشابه
The Halting Probability in Von Neumann Architectures
Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of u...
متن کاملComplete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that ...
متن کاملDisjunction Property and Finite Model Property For an Intuitionistic Epistemic Logic
We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a ...
متن کاملEpistemic Reasoning in Logic Programs
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and ...
متن کاملUnbounded Allocation in Bounded Heaps
In this paper we introduce a new symbolic semantics for a class of recursive programs which feature dynamic creation and unbounded allocation of objects. We use a symbolic representation of the program state in terms of equations to model the semantics of a program as a pushdown system with a finite set of control states and a finite stack alphabet. Our main technical result is a rigorous proof...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.06845 شماره
صفحات -
تاریخ انتشار 2017